Multitarget Linear-Quadratic Control Problem: Semi-Infinite Interval
نویسندگان
چکیده
منابع مشابه
Multitarget Linear-Quadratic Control Problem: Semi-Infinite Interval
We consider multi-target linear-quadratic control problem on semiinfinite interval. We show that the problem can be reduced to a simple convex optimization problem on the simplex
متن کاملRemark on multi-target, robust linear-quadratic control problem on semi-infinite interval
We consider multi-target, robust linear-quadratic control problem on semi-infinite interval. Using functional-analytic approach developed in [2], we reduce this problem to a convex optimization problem on the simplex. Explicit procedure for the evaluation of the reduced objective function is described.
متن کاملLinear-quadratic control problem with a linear term on semiinfinite interval: theory and applications∗
We describe a complete solution of the linear-quadratic control problem on a semiinfinite interval with the linear term in the objective function. Some applications are considered.
متن کاملThe singular linear quadratic Gaussian control problem
In this paper we discuss the standard LQG control problem for linear, finite-dimensional time-invariant systems without any assumptions on the system parameters. We give an explicit formula for the infimum over all internally stabilizing strictly proper compensators and give a characterization when the infimum is attained.
متن کاملSemi Quadratic Assignment Problem
Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π ⊆ Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the corresponding Semi-Tree-QAP is solvable in polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/535610